Pair hidden Markov models on tree structures
نویسندگان
چکیده
منابع مشابه
Pair hidden Markov models on tree structures
MOTIVATION Computationally identifying non-coding RNA regions on the genome has much scope for investigation and is essentially harder than gene-finding problems for protein-coding regions. Since comparative sequence analysis is effective for non-coding RNA detection, efficient computational methods are expected for structural alignments of RNA sequences. On the other hand, Hidden Markov Models...
متن کاملLearning Morphology with Pair Hidden Markov Models
In this paper I present a novel Machine Learning technique based on Pair Hidden Markov Models, a statistical model used in bioinformatics. This technique can be used to learn nite-state string to string transductions. I present a model of the acquisition of the English past tense. The same model can also learn without modiication the Arabic broken plural, a much more complex morphological syste...
متن کاملParameter estimation in pair hidden Markov models
This paper deals with parameter estimation in pair hidden Markov models (pairHMMs). We first provide a rigorous formalism for these models and discuss possible definitions of likelihoods. The model being biologically motivated, some restrictions with respect to the full parameter space naturally occur. Existence of two different Information divergence rates is established and divergence propert...
متن کاملInducing Sound Segment Differences Using Pair Hidden Markov Models
Pair Hidden Markov Models (PairHMMs) are trained to align the pronunciation transcriptions of a large contemporary collection of Dutch dialect material, the GoemanTaeldeman-Van Reenen-Project (GTRP, collected 1980–1995). We focus on the question of how to incorporate information about sound segment distances to improve sequence distance measures for use in dialect comparison. PairHMMs induce se...
متن کاملNotes on Hidden Markov Models
A Markov model, or Markov chain, can be viewed as a stochastic finite state automaton in which each transition is labeled with a probability in such a way that the set of transitions from a given state have their probability labels adding up to 1. If in addition each state is labeled with an observable symbol, the probability of a string of symbols [x1, x2, ..., xn] (abbreviated as x1,n) is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2003
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btg1032